/**
 * #      1368
 * 名称   使网格图至少有一条有效路径的最小代价
 * 链接   https://leetcode-cn.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid
 * 题解   [77](https://leetcode-cn.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/solution)
 * 通过率 51.1%
 * 难道   困难
 */

